Computing the minimal number of equations defining an affine curve ideal-theoretically

نویسنده

  • Hans Schoutens
چکیده

There is an algorithm which computes the minimal number of generators of the ideal of a reduced curve C in affine n-space over an algebraically closed field K, provided C is not a local complete intersection. The existence of such an algorithm follows from the fact that given d ∈ N, there exists d ∈ N, such that if a is a height n−1 radical ideal inK[X1, . . . ,Xn], generated by polynomials of degree at most d, then a admits a set of generators of minimal cardinality, with each generator having degree at most d, except possibly when K[X1, . . . ,Xn]/a is an (unmixed) local complete intersection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determinantal ideals and monomial curves in the three-dimensional space

We show that the defining ideal of every monomial curve in the affine or projective three-dimensional space can be set-theoretically defined by three binomial equations, two of which set-theoretically define a determinantal ideal generated by the 2-minors of a 2× 3 matrix with monomial entries.

متن کامل

Finding a Basis of a Linear System with Pairwise Distinct Discrete Valuations on an Algebraic Curve

Under the assumption that we have defining equations of an affine algebraic curve in special position with respect to a rational place Q, we propose an algorithm computing a basis of L(D) of a divisor D from an ideal basis of the ideal L(D +∞Q) of the affine coordinate ring L(∞Q) of the given algebraic curve, where L(D+∞Q) := S∞ i=1 L(D+ iQ). Elements in the basis produced by our algorithm have...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Cohen-macaulayness of Tangent Cones

We give a criterion for checking the Cohen-Macaulayness of the tangent cone of a monomial curve by using the Gröbner basis. For a family of monomial curves, we give the full description of the defining ideal of the curve and its tangent cone at the origin. By using this family of curves and their extended versions to higher dimensions, we prove that the minimal number of generators of a Cohen-M...

متن کامل

Discrete Affine Minimal Surfaces with Indefinite Metric

Inspired by the Weierstrass representation of smooth affine minimal surfaces with indefinite metric, we propose a constructive process producing a large class of discrete surfaces that we call discrete affine minimal surfaces. We show that they are critical points of an affine area functional defined on the space of quadrangular discrete surfaces. The construction makes use of asymptotic coordi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005